An Impossibility Theorem in Matching Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Impossibility Theorem in matching problems

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to the matching problems. Alcalde and Barberá (1994) show that efficient and individually rational matching rules are manipulable in the one-to-one matching model. Thus, we pursue the possibility of strategy-proof matching rules by relaxing efficiency to a weaker condition of respect for unanimity. Our fi...

متن کامل

Discussion Paper No. 677 AN IMPOSSIBILITY THEOREM IN MATCHING PROBLEMS

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that efficient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof matching rules by relaxing efficiency to the weaker condition of respect for unanimity. Our first resu...

متن کامل

An Impossibility Theorem for Clustering

Although the study of clustering is centered around an intuitively compelling goal, it has been very difficult to develop a unified framework for reasoning about it at a technical level, and profoundly diverse approaches to clustering abound in the research community. Here we suggest a formal perspective on the difficulty in finding such a unification, in the form of an impossibility theorem: f...

متن کامل

An impossibility theorem for verisimilitude

In this paper, we show that Arrow’s well-known impossibility theorem is instrumental in bringing the ongoing discussion about verisimilitude to amore general level of abstraction. After some preparatory technical steps, we show that Arrow’s requirements for voting procedures in social choice are also natural desiderata for a general verisimilitude definition that places content and likeness con...

متن کامل

An Impossibility Theorem on Beliefs in Games

A paradox of self-reference in beliefs in games is identified, which yields a game-theoretic impossibility theorem akin to Russell’s Paradox. An informal version of the paradox is that the following configuration of beliefs is impossible: Ann believes that Bob assumes that Ann believes that Bob’s assumption is wrong This is formalized to show that any belief model of a certain kind must have a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2006

ISSN: 1556-5068

DOI: 10.2139/ssrn.951136